An Empirical Study of Probabilistic Arc Consistency as a Variable Ordering Heuristic
نویسندگان
چکیده
We report on an empirical evaluation of a new probabilistic heuristic for constructive search in constraint satisfaction problems. The heuristic is based on the estimation of solution probability. We show empirically that this heuristic is more accurate than related heuristics, and reduces the number of consistency checks and backtracks in constructive search by up to several orders of magnitude. Our results also show that the time required to estimate solution probabilities is less than the time required for search using other well-known heuristics as the problem size increases.
منابع مشابه
Two New Lightweight Arc Consistency Algorithms
Coarse-grained arc consistency algorithms like AC-3, AC-3d, and AC-2001, are efficient when it comes to transforming a Constraint Satisfaction Problem (CSP) to its arc consistent equivalent. These algorithms repeatedly carry out revisions to remove unsupported values from the domains of the variables. The order of these revisions is determined by so-called revision ordering heuristics. In this ...
متن کاملHistogram Arc Consistency as a Value Ordering Heuristic
The Constraint Satisfaction Problem (CSP:I is NP-hard. Finding solutions requires searching in an exponential space of possible variable assignments. Good value ordering heuristics are essential for finding solutions to CSPs. Such heuristics estimate the probability that any particular variable assignment will appear in a globally consistent solution. Unfortunately, computing solution probabili...
متن کاملAbscon 2005
This paper describes the algorithms, heuristics and strategies used by the two solvers which have been elaborated from the Abscon platform and submitted to the first CSP solver competition. Both solvers maintain arc consistency during search, explore the search space using a conflict-directed variable ordering heuristic and integrate a restart strategy. At preprocessing, the first solver establ...
متن کاملConnict-directed Backjumping Revisited
In recent years, many improvements to backtracking algorithms for solving constraint satisfaction problems have been proposed. The techniques for improving backtracking algorithms can be conveniently classi ed as look-ahead schemes and look-back schemes. Unfortunately, look-ahead and look-back schemes are not entirely orthogonal as it has been observed empirically that the enhancement of look-a...
متن کاملAbscon 109 A generic CSP solver
This paper describes the algorithms, heuristics and general strategies used by the two solvers which have been elaborated from the Abscon platform and submitted to the second CSP solver competition. Both solvers maintain generalized arc consistency during search, explore the search space using a conflict-directed variable ordering heuristic, integrate nogood recording from restarts and exploit ...
متن کامل